Intelligent Block Iterative Methods 1

نویسنده

  • Jan Mandel
چکیده

SUMMARY We present several preconditioned conjugate gradient methods for the iterative solution of the linear, symmetric systems of equations arising from the nite element method in displacement form, both for the h-version and the p-version. The preconditioners are based on a decomposition of the solution space into overlapping subspaces and solving separately on each subspace. A judicious choice of the subspaces gives good convergence for a uniform mesh. Local adaptive techniques are employed to modify the subspaces for real-world problems with distorted meshes and thin 3D elements. Computational results on workstations are presented for solid and shell aircraft structures with up to over 1,000,000 degrees of freedom and 4GB stiiness matrix. 1. INTRODUCTION Much of the current state of the art in the Finite Element Method (FEM) has been motivated by the necessity to obtain useful practical results from relatively coarse discretizations, thus creating the need for substantial engineering expertise in applying the nite element analysis lest erroneous results are obtained. One way to increase the automatization and reliability of nite element analysis is to use ner and more precise discretizations, in particular high order discretizations, the p-version FEM. (Weaknesses of the mathematical model such as spurious singularities are clearly revealed this way, but that is outside the scope of this article.) Possibly in a not too distant future, it will be possible to dump a CAD model with all geometrical complexity as input to the FEM at a reasonable cost, without worrying about non-physical models and wrong solutions. The ever more powerful computers make the treatment of such discretizations possible. But the classical, direct solution methods for the resulting large, sparse systems of algebraic equations suuer from terminal ll-in and their requirements on storage space and CPU time grow much faster that the number of degrees of freedom. Iterative solvers use the original system data and avoid ll-in, but the performance of most iterative methods is inconsistent and not suitable for industrial type problem. In the last decade, a new class of iterative methods for the numerical solution of partial diierential equations has emerged, the multigrid methods and domain decomposition methods, see, e.g., the surveys 19, 24]. These methods use the properties of the underlying diierential

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weights in block iterative methods

In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...

متن کامل

Generalized iterative methods for solving double saddle point problem

In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version  of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...

متن کامل

A New Iterative Neural Based Method to Spot Price Forecasting

Electricity price predictions have become a major discussion on competitive market under deregulated power system. But, the exclusive characteristics of electricity price such as non-linearity, non-stationary and time-varying volatility structure present several challenges for this task. In this paper, a new forecast strategy based on the iterative neural network is proposed for Day-ahead price...

متن کامل

ITERATIVE METHOD FOR SOLVING TWO-DIMENSIONAL NONLINEAR FUZZY INTEGRAL EQUATIONS USING FUZZY BIVARIATE BLOCK-PULSE FUNCTIONS WITH ERROR ESTIMATION

In this paper, we propose an iterative procedure based on two dimensionalfuzzy block-pulse functions for solving nonlinear fuzzy Fredholm integralequations of the second kind. The error estimation and numerical stabilityof the proposed method are given in terms of supplementary Lipschitz condition.Finally, illustrative examples are included in order to demonstrate the accuracyand convergence of...

متن کامل

A New Two-stage Iterative Method for Linear Systems and Its Application in Solving Poisson's Equation

In the current study we investigate the two-stage iterative method for solving linear systems. Our new results shows which splitting generates convergence fast in iterative methods. Finally, we solve the Poisson-Block tridiagonal matrix from Poisson's equation which arises in mechanical engineering and theoretical physics. Numerical computations are presented based on a particular linear system...

متن کامل

A parallel block iterative method for the hydrodynamic device model

Block iterative methods are applied to hydrodynamic simulations of a one-dimensional (1-D) submicrometer semiconductor device. We show that block successive underrelaxation (SUR) converges with a fixed relaxation factor w = 0.13 for simulations at 300 K and w = 0.04 at 77 K . To demonstrate the robustness of the block iterative method, we present numerical simulations of a steady-state electron...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993